//看1.19题目要求

#include<limits.h>

Status poly(int n,int *a,int length)
{
	if(n > length)
		exit(ERROR);
	a[0] = 1;
	for(i = 0;i < n;i++)
		if((a[i] = a[i - 1] * 2 * i) >= MAXINT)
			return ERROR;
	return OK;
}

//看题目1.20

int poly_n(int *a)
{
	int i;
	int n = a[0];
	int x0 = a[1];
	t = a[n - 2] + a[n - 1] * x0;
	for(i = n - 3;i >= 0;i--)
		t = t * i + a[i];
	return t;
}
